Time-Bin Superposition Methods for DPS-QKD

نویسندگان

چکیده

Key generation efficiency, and security, in DPS-QKD improve with an increase the number of path delays or time-bin superpositions. We demonstrate implementation super-position states using time-bins, establish equivalence path-based superposition, thus yielding a simpler higher-order superposition for differential phase-shift quantum key distribution (DPS-QKD). set up DPS-QKD, over 105 km single mode optical fiber, bit error rate less than 15% at secure 2 kbps. With temporal guard bands, QBER reduced to 10%, but 20% reduction rate.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Countermeasure against tailored bright illumination attack for DPS-QKD.

We propose a countermeasure against the so-called tailored bright illumination attack for differential-phase-shift QKD (DPS-QKD). By monitoring a rate of coincidence detection at a pair of superconducting nanowire single-photon detectors (SSPDs) which is connected at each of the output ports of Bob's Mach-Zehnder interferometer, Alice and Bob can detect and defeat this kind of attack. We also e...

متن کامل

islanding detection methods for microgrids

امروزه استفاده از منابع انرژی پراکنده کاربرد وسیعی یافته است . اگر چه این منابع بسیاری از مشکلات شبکه را حل می کنند اما زیاد شدن آنها مسائل فراوانی برای سیستم قدرت به همراه دارد . استفاده از میکروشبکه راه حلی است که علاوه بر استفاده از مزایای منابع انرژی پراکنده برخی از مشکلات ایجاد شده توسط آنها را نیز منتفی می کند . همچنین میکروشبکه ها کیفیت برق و قابلیت اطمینان تامین انرژی مشترکان را افزایش ...

15 صفحه اول

Trust-region superposition methods for protein alignment

Protein alignment is a challenging applied optimization problem. Superposition methods are based on the maximization of a score function with respect to rigid-body modifications of relative positions. The problem of score maximization can be modelled as a continuous nonsmooth optimization problem (low order-value optimization (LOVO)). This allows one to define practical and convergent methods t...

متن کامل

LDPC for QKD Reconciliation

—We present the Low Density Parity Check (LDPC) forward error correction algorithm adapted for the Quantum Key Distribution (QKD) protocol in a form readily applied by developers. A sparse parity check matrix is required for the LDPC algorithm and we suggest using some that have been defined by the IEEE and ETSI standards organizations for use in various communication protocols. We evaluate the...

متن کامل

Linear time-approximation algorithms for bin packing

Simchi-Levi (Naval Res. Logist. 41 (1994) 579–585) proved that the famous bin packing algorithms FF and BF have an absolute worst-case ratio of no more than 4 , and FFD and BFD have an absolute worst-case ratio of 3 2 , respectively. These algorithms run in time O(n log n). In this paper, we provide a linear time constant space (number of bins kept during the execution of the algorithm is const...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Photonics Journal

سال: 2022

ISSN: ['1943-0655', '1943-0647']

DOI: https://doi.org/10.1109/jphot.2022.3204920